On Perfectly Balanced Boolean Functions

نویسنده

  • Oleg A. Logachev
چکیده

Perfectly balanced functions were introduced by Sumarokov in [1]. A well known class of such functions are those linear either in the first or in the last variable. We present a novel technique to construct perfectly balanced functions not in the above class.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfectly Balanced Functions in Symbolic Dynamics

In the present paper we study properties of perfectly balanced Boolean functions. Based on the concept of Boolean function barrier, we propose a novel approach to construct large classes of perfectly balanced Boolean functions.

متن کامل

Weightwise perfectly balanced functions with high weightwise nonlinearity profile

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher [13]. In this paper, we propose a large class of weightwise perfectly balanced (WPB) functions, which is not extended affinely (EA) equivalent to the known constructions. We also discuss the weightwise nonlinearity profile ...

متن کامل

On maximally nonlinear and extremal balanced Boolean functions

We prove a new sufficient condition for a Boolean function to be extremal balanced or maximally nonlinear, in odd or even dimension. Under this condition, we deduce the balanced covering radius ρB(n) and the covering radius ρ(n). We prove some general properties about maximally nonlinear or extremal balanced functions. Finally, an application to even weights Boolean functions is given.

متن کامل

Highly Nonlinear 0 - 1 Balanced Boolean Functions Satisfying

Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent functions have maximum nonlinearity and satisfy SAC however they are not 0-1 balanced and hence cannot be directly used in many cryptosystems where 0-1 balancedness is needed. In this paper we construct (i) 0-1 balanced boolean functions on V2k+1 (k > = 1) having nonlinea...

متن کامل

Balanced Boolean Function on 13-variables having Nonlinearity strictly greater than the Bent Concatenation Bound

Very recently, Kavut and Yucel identified 9-variable Boolean functions having nonlinearity 242, which is currently the best known. However, any of these functions do not contain any zero in the Walsh spectrum and that is why they cannot be made balanced. We use these functions to construct 13-variable balanced Boolean function having nonlinearity 213−1 − 2 13−1 2 + 2 = 4034 which is strictly gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2007  شماره 

صفحات  -

تاریخ انتشار 2007